public class demo16 {
    //宝石补给
/*    class Solution {
        public int giveGem(int[] gem, int[][] operations) {
            int l1 = operations.length;
            int l2 = operations[0].length;
            int l3 = gem.length;
            int tmp = 0;
            for(int i = 0; i<l1; i++){
                int n1 = operations[i][0];
                int n2 = operations[i][l2-1];
                tmp = gem[n1]/2;
                gem[n1]-= tmp;
                gem[n2]+= tmp;

            }
            Arrays.sort(gem);
            return gem[l3-1] - gem[0];
        }
    }*/
}
